Automated discovery of angle theorems

Abstract We consider geometry theorems whose premises and statement comprise a set of bisector conditions. Each premise the can be represented as rows “bisector matrix”: one with three non zero elements per row, element value -2 others 1. The existence theorem corresponds to rank deficiency in this matrix. Our method discovery starts identification deficient matrices. Some such matrices graphs vertices correspond matrix edges columns. show that if which graph is deficient, then bicubic. give an algorithm for finding Hamiltonian bicubic graph, report on results 6,8,10 12 vertices. discuss deriving more than 2 non-zero elements. extend work containing corresponding angle trisectors.